Search results for "Free abelian group"

showing 3 items of 3 documents

Abelian gradings on upper-triangular matrices

2003

Let G be an arbitrary finite abelian group. We describe all possible G-gradings on an upper-triangular matrix algebra over an algebraically closed field of characteristic zero.

CombinatoricsTorsion subgroupG-moduleGeneral MathematicsElementary abelian groupAbelian categoryAbelian groupRank of an abelian groupFree abelian groupArithmetic of abelian varietiesMathematicsArchiv der Mathematik
researchProduct

A note on easy and efficient computation of full abelian periods of a word

2016

Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Elementary abelian groupComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology[INFO] Computer Science [cs]01 natural sciencesRank of an abelian groupCombinatoricsSimple (abstract algebra)Computer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsData Structures and Algorithms (cs.DS)[INFO]Computer Science [cs]Abelian groupHidden subgroup problemDiscrete Mathematics and CombinatoricComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematicsApplied Mathematics020206 networking & telecommunicationsAbelian periodText algorithmWeak repetitionFree abelian groupAbelian powerCombinatorics on wordsDesign of algorithm010201 computation theory & mathematicsWord (computer architecture)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

On the classification of CAT(0) structures for the 4-string braid group

2005

This paper is concerned with the class of so-called CAT(0) groups, namely, those groups that admit a geometric (i.e., properly discontinuous, co-compact, and isometric) action on some CAT(0) space. More precisely, we are interested in knowing to what extent it is feasible to classify the geometric CAT(0) actions of a given group (up to, say, equivariant homothety of the space). A notable example of such a classification is the flat torus theorem, which implies that the minimal geometric CAT(0) actions of the free abelian group Z (n ≥ 1) are precisely the free actions by translations of Euclidean space E. Typically, however, a given group will have uncountably many nonequivalent actions, mak…

[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT][ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]General Mathematics20F56Braid group20F36Center (group theory)01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]Combinatoricssymbols.namesakeEuler characteristic[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]0103 physical sciences0101 mathematicsComputingMilieux_MISCELLANEOUSMathematics[MATH.MATH-GR] Mathematics [math]/Group Theory [math.GR][MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]Euclidean spaceGroup (mathematics)010102 general mathematicsFree abelian groupAlgebraFree groupsymbolsEquivariant map010307 mathematical physics
researchProduct